Goodness of Time-Processor Optimal PRAM Simulations
نویسنده
چکیده
We address the question 'how to measure goodness of time-processor optimal PRAM simulations'. Instead of measuring only the asymptotic complexity of simulation time, we attempt to take into account all aspects of simulations exactly. We present a goodness function framework and propose a generic function for measuring the goodness.
منابع مشابه
Balanced PRAM Simulations via Moving Threads and Hashing
We present a novel approach to parallel computing, where (virtual) PRAM processors are represented as lightweight threads, and each physical processor is capable of managing several threads. Instead of moving read and write requests, and replies between processor&memory pairs (and caches), we move the lightweight threads. Consequently , the processor load balancing problem reduces to the proble...
متن کاملBalanced PRAM Simulations via Moving Threads and Hashing
We present a novel approach to parallel computing, where (virtual) PRAM processors are represented as light-weight threads, and each physical processor is capable of managing several threads. Instead of moving read and write requests, and replies between processor&memory pairs (and caches), we move the light-weight threads. Consequently, the processor load balancing problem reduces to the probl...
متن کاملExperimental Simulations of PRAM on Complete Networks
Consider the routing problem of p processors sending packets to each other at random, under the OCPC restriction, where a sending fails if another processor tries to send to the same target. Finding eecient and implementable solutions to this problem would be very desirable for the implementation of PRAM (parallel random access machine). There are two principal means to speed up routing: to imp...
متن کاملContention resolution in hashing based shared memory simulations
In this paper we study the problem of simulating shared memory on the distributed memory machine (DMM). Our approach uses multiple copies of shared memory cells, distributed among the memory modules of the DMM via universal hashing. The main aim is to design strategies that resolve contention at the memory modules. Extending results and methods from random graphs and very fast randomized algori...
متن کاملShared Memory Simulations with Triple-Logarithmic Delay
We consider the problem of simulating a PRAM on a distributed memory machine (DMM). Our main result is a randomized algorithm that simulates each step of an n-processor CRCW PRAM on an n-processor DMM with O(log log log n log n) delay, with high probability. This is an exponential improvement on all previously known simulations. It can be extended to a simulation of an (n log log log n log n)-p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996